Solving Unit Commitment Problem Using Modified Subgradient Method Combined with Simulated Annealing Algorithm

Simulated Annealing Combined with Evolutionary Algorithm to Unit Commitment Problem

Solving the Unit Commitment Problem Using Modified Imperialistic Competition Algorithm

One of the most important problems for power system operation is unit commitment (UC), for which different constraints should be satisfied. UC is a nonlinear and large-scale problem; thus, using the evolutionary algorithms has been considered for solving the problem. In this paper, the solution of the UC problem was investigated using Modified Imperialistic Competition Algorithm (MICA).  Simula...

Solving Bus Terminal Location Problem Using Simulated Annealing Method

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm.&...

Feasible Modified Subgradient Method for Solving the Thermal Unit Commitment Problem as a New Approach

The Lagrangian relaxationLRbased methods are commonly used to solve the thermal unit commitment UC problem which is an important subject in power system engineering. The main drawback of this group of methods is the difference between the dual and the primal solutions which gives some significant problems on the quality of the feasible solutions. In this paper, a new approach, feasible modified...

Solving Bus Terminal Location Problem Using Simulated Annealing Method

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm. ...